IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS
نویسندگان
چکیده
منابع مشابه
Improving the Computational Efficiency of Combinatorial Auction Algorithms
This paper introduces two algorithms (both actually are variants of a single algorithm)—the First price Upper Bound, FUB, and Second price Lower Bound, SeLB, algorithms—aimed at serving as subroutines in computationally efficient algorithms for combinatorial auctions. The type of combinatorial auctions treated in the paper are the once where bids are placed on one unit of one or more items at a...
متن کاملGATE: improving the computational efficiency
GATE is a software dedicated to Monte Carlo simulations in Single Photon Emission Computed Tomography (SPECT) and Positron Emission Tomography (PET). An important disadvantage of those simulations is the fundamental burden of computation time. This manuscript describes three different techniques in order to improve the efficiency of those simulations. Firstly, the implementation of variance red...
متن کاملassessment of the efficiency of s.p.g.c refineries using network dea
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
Improving Computational Efficiency of VAST
....... ................................................................................................................................. i Executive summary ........................................................................................................................ iii Table of contents ...................................................................................................
متن کاملImproving the Efficiency of Exclusion Algorithms
Exclusion algorithms are a well-known tool in the area of interval analysis, see, e.g., [5, 6], for finding all solutions of a system of nonlinear equations. They also have been introduced in [14, 15] from a slightly different viewpoint. In particular, such algorithms seem to be very useful for finding all solutions of low-dimensional, but highly nonlinear systems which have many solutions. Suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1984
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.27.59